Blind Deconvolution with Re-weighted Sparsity Promotion

نویسندگان

  • Dilip Krishnan
  • Joan Bruna
  • Rob Fergus
چکیده

Blind deconvolution has made significant progress in the past decade. Most successful algorithms are classified either as Variational or Maximum a-Posteriori (MAP ). In spite of the superior theoretical justification of variational techniques, carefully constructed MAP algorithms have proven equally effective in practice. In this paper, we show that all successful MAP and variational algorithms share a common framework, relying on the following key principles: sparsity promotion in the gradient domain, l2 regularization for kernel estimation, and the use of convex (often quadratic) cost functions. Our observations lead to a unified understanding of the principles required for successful blind deconvolution. We incorporate these principles into a novel algorithm that improves significantly upon the state of the art.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind Deconvolution with Non-local Sparsity Reweighting

Blind deconvolution has made significant progress in the past decade. Most successful algorithms are classified either as Variational or Maximum a-Posteriori (MAP ). In spite of the superior theoretical justification of variational techniques, carefully constructed MAP algorithms have proven equally effective in practice. In this paper, we show that all successful MAP and variational algorithms...

متن کامل

Fundamental Limits of Blind Deconvolution Part II: Sparsity-Ambiguity Trade-offs

Blind deconvolution is an ubiquitous non-linear inverse problem in applications like wireless communications and image processing. This problem is generally ill-posed since signal identifiability is a key concern, and there have been efforts to use sparse models for regularizing blind deconvolution to promote signal identifiability. Part I of this two-part paper establishes a measure theoretica...

متن کامل

RIP-like Properties in Subsampled Blind Deconvolution

We derive near optimal performance guarantees for subsampled blind deconvolution. Blind deconvolution is an ill-posed bilinear inverse problem and additional subsampling makes the problem even more challenging. Sparsity and spectral flatness priors on unknown signals are introduced to overcome these difficulties. While being crucial for deriving desired near optimal performance guarantees, unli...

متن کامل

Fundamental Limits of Blind Deconvolution Part I: Ambiguity Kernel

Blind deconvolution is an ubiquitous non-linear inverse problem in applications like wireless communications and image processing. This problem is generally ill-posed, and there have been efforts to use sparse models for regularizing blind deconvolution to promote signal identifiability. Part I of this two-part paper characterizes the ambiguity space of blind deconvolution and shows unidentifia...

متن کامل

Unsupervised multi-tissue decomposition of single-shell diffusion-weighted imaging by generalization to multi-modal data

Introduction In recent years, data-driven analysis of diffusion-weighted imaging (DWI) has been extended beyond white matter (WM), explicitly modelling partial voluming with adjacent tissues. Supervised methods such as singleand multi-tissue constrained spherical deconvolution (CSD) reconstruct orientation distribution functions (ODF) of WM, grey matter (GM), and cerebrospinal fluid (CSF), give...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1311.4029  شماره 

صفحات  -

تاریخ انتشار 2013